|
In mathematics, the Perrin numbers are defined by the recurrence relation :''P''(0) = 3, ''P''(1) = 0, ''P''(2) = 2, and :''P''(''n'') = ''P''(''n'' − 2) + ''P''(''n'' − 3) for ''n'' > 2. The sequence of Perrin numbers starts with :3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, 29, 39 ... The number of different maximal independent sets in an ''n''-vertex cycle graph is counted by the ''n''th Perrin number for ''n'' > 1. ==History== This sequence was mentioned implicitly by Édouard Lucas (1876). In 1899, the same sequence was mentioned explicitly by François Olivier Raoul Perrin. The most extensive treatment of this sequence was given by Adams and Shanks (1982). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Perrin number」の詳細全文を読む スポンサード リンク
|